Metric propositional neighborhood logic with an equivalence relation
نویسندگان
چکیده
منابع مشابه
Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders
We investigate the question of how much hybrid machinery can be added to the interval neighbourhood logic PNL and its metric extension MPNL without losing the decidability of their satisfiability problem in N. In particular, we consider the natural hybrid extension of MPNL obtained by adding binders on integer variables ranging over lengths of intervals, thus enabling storage of the length of t...
متن کاملAn Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
In this paper we focus our attention on the decision problem for Propositional Neighborhood Logic (PNL for short). PNL is the proper subset of Halpern and Shoham’s modal logic of intervals whose modalities correspond to Allen’s relations meets and met by. We show that the satisfiability problem for PNL over the integers is NEXPTIME-complete. Then, we develop a sound and complete tableau-based d...
متن کاملTemporal Reasoning in Propositional Interval Neighborhood Logic
Interval-based temporal reasoning is an important field of various areas of Computer Science and Artificial Intelligence, such as planning and natural language processing. In this paper we show that the satisfiability problem for one of the most important formalisms for interval-based reasoning, namely Allen’s Interval Algebra, can be reduced to the satisfiability problem for Propositional Neig...
متن کاملBlockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?
Clause-elimination techniques that simplify formulas by removing redundant clauses play an important role in modern SAT solving. Among the types of redundant clauses, blocked clauses are particularly popular. For checking whether a clause C is blocked in a formula F , one only needs to consider the so-called resolution neighborhood of C, i.e., the set of clauses that can be resolved with C. Bec...
متن کاملUsing Temporal Logic for Spatial Reasoning: Temporalized Propositional Neighborhood Logic
In this paper we develop a new modal logic for spatial reasoning called Temporalized Propositional Neighborhood Logic, which is the result of the application of a known technique called temporalization to a known temporal logic for spatial reasoning (PNL). We will show that our logic is expressive enough to formalize interesting spatial statements and that it is decidable in NEXPTIME.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2016
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-016-0256-3